Input Device Selection and Interaction Configuration with ICON

International audienceThis paper describes ICON, a novel editor designed to configure a set of input devices and connect them to actions into a graphical interactive application. ICON allows physically challenged users to connect alternative input devices and/or configure their interaction techniques according to their needs. It allows skilled users - graphic designers or musicians for example - to configure any ICON aware application to use their favorite input devices and interaction techniques (bimanual, voice enabled, etc.). ICON works with Java Swing and requires applications to describe their interaction styles in terms of ICON modules. By using ICON, users can adapt more deeply than before their applications and programmers can easily provide extensibility to their applications

Modelling and Formal Verification of Neuronal Archetypes Coupling

International audienceIn the literature, neuronal networks are often represented as graphs where each node symbolizes a neuron and each arc stands for a synaptic connection. Some specific neuronal graphs have biologically relevant structures and behaviors and we call them archetypes. Six of them have already been characterized and validated using formal methods. In this work, we tackle the next logical step and proceed to the study of the properties of their couplings. For this purpose, we rely on Leaky Integrate and Fire neuron modeling and we use the synchronous programming language Lustre to implement the neuronal archetypes and to formalize their expected properties. Then, we exploit an associated model checker called kind2 to automatically validate these behaviors. We show that, when the archetypes are coupled, either these behaviors are slightly modulated or they give way to a brand new behavior. We can also observe that different archetype couplings can give rise to strictly identical behaviors. Our results show that time coding modeling is more suited than rate coding modeling for this kind of studies

Five New Transits of the Super-Neptune HD 149026

We present new photometry of HD 149026 spanning five transits of its "super-Neptune" planet. In combination with previous data, we improve upon the determination of the planet-to-star radius ratio: R_p/R_star = 0.0491^{+0.0018}_{-0.0005}. We find the planetary radius to be 0.71 +/- 0.05 R_Jup, in accordance with previous theoretical models invoking a high metal abundance for the planet. The limiting error is the uncertainty in the stellar radius. Although we find agreement among four different ways of estimating the stellar radius, the uncertainty remains at 7%. We also present a refined transit ephemeris and a constraint on the orbital eccentricity and argument of pericenter, e cos(omega) = -0.0014 +/- 0.0012, based on the measured interval between primary and secondary transits.Comment: To appear in ApJ [19 pages

Machine-Checked Proofs For Realizability Checking Algorithms

Virtual integration techniques focus on building architectural models of systems that can be analyzed early in the design cycle to try to lower cost, reduce risk, and improve quality of complex embedded systems. Given appropriate architectural descriptions, assume/guarantee contracts, and compositional reasoning rules, these techniques can be used to prove important safety properties about the architecture prior to system construction. For these proofs to be meaningful, each leaf-level component contract must be realizable; i.e., it is possible to construct a component such that for any input allowed by the contract assumptions, there is some output value that the component can produce that satisfies the contract guarantees. We have recently proposed (in [1]) a contract-based realizability checking algorithm for assume/guarantee contracts over infinite theories supported by SMT solvers such as linear integer/real arithmetic and uninterpreted functions. In that work, we used an SMT solver and an algorithm similar to k-induction to establish the realizability of a contract, and justified our approach via a hand proof. Given the central importance of realizability to our virtual integration approach, we wanted additional confidence that our approach was sound. This paper describes a complete formalization of the approach in the Coq proof and specification language. During formalization, we found several small mistakes and missing assumptions in our reasoning. Although these did not compromise the correctness of the algorithm used in the checking tools, they point to the value of machine-checked formalization. In addition, we believe this is the first machine-checked formalization for a realizability algorithm.Comment: 14 pages, 1 figur

Survey for Transiting Extrasolar Planets in Stellar Systems: III. A Limit on the Fraction of Stars with Planets in the Open Cluster NGC 1245

We analyze a 19-night photometric search for transiting extrasolar planets in the open cluster NGC 1245. An automated transit search algorithm with quantitative selection criteria finds six transit candidates; none are bona fide planetary transits. We characterize the survey detection probability via Monte Carlo injection and recovery of realistic limb-darkened transits. We use this to derive upper limits on the fraction of cluster members with close-in Jupiter-radii, RJ, companions. We carefully analyze the random and systematic errors of the calculation. For similar photometric noise and weather properties as this survey, observing NGC 1245 twice as long results in a tighter constraint on "Hot Jupiter", HJ, companions than observing an additional cluster of similar richness as NGC 1245 for the same length of time as this survey. This survey observed ~870 cluster members. If 1% of stars have 1.5 RJ HJ companions, we expect to detect one planet for every 5000 dwarf stars observed for a month. To reach a ~2% upper limit on the fraction of stars with 1.5 RJ HJ companions, we conclude a total sample size of ~7400 dwarf stars observed for at least a month will be needed. Results for 1.0 RJ companions, without substantial improvement in the photometric precision, will require a small factor larger sample size.Comment: 24 pages, 15 figures, submitted A

Asynchronous Testing of Synchronous Components in GALS Systems

International audienceGALS (Globally Asynchronous Locally Synchronous) systems, such as the Internet of Things or autonomous cars, integrate reactive synchronous components that interact asynchronously. The complexity induced by combining synchronous and asynchronous aspects makes GALS systems difficult to develop and debug. Ensuring their functional correctness and reliability requires rigorous design methodologies, based on formal methods and assisted by validation tools. In this paper we propose a testing methodology for GALS systems integrating: (1) synchronous and asynchronous concurrent models; (2) functional unit testing and behavioral conformance testing; and (3) various formal methods and their tool equipments. We leverage the conformance test generation for asynchronous systems to automatically derive realistic scenarios (input constraints and oracle), which are necessary ingredients for the unit testing of individual synchronous components, and are difficult and error-prone to design manually. We illustrate our approach on a simple, but relevant example inspired by autonomous cars

Scaling Bounded Model Checking By Transforming Programs With Arrays

Bounded Model Checking is one the most successful techniques for finding bugs in program. However, model checkers are resource hungry and are often unable to verify programs with loops iterating over large arrays.We present a transformation that enables bounded model checkers to verify a certain class of array properties. Our technique transforms an array-manipulating (ANSI-C) program to an array-free and loop-free (ANSI-C) program thereby reducing the resource requirements of a model checker significantly. Model checking of the transformed program using an off-the-shelf bounded model checker simulates the loop iterations efficiently. Thus, our transformed program is a sound abstraction of the original program and is also precise in a large number of cases - we formally characterize the class of programs for which it is guaranteed to be precise. We demonstrate the applicability and usefulness of our technique on both industry code as well as academic benchmarks

A pair of planets around HD 202206 or a circumbinary planet?

Long-term precise Doppler measurements with the CORALIE spectrograph reveal the presence of a second planet orbiting the solar-type star HD202206. The radial-velocity combined fit yields companion masses of m_2\sini = 17.4 M_Jup and 2.44 M_Jup, semi-major axes of a = 0.83 AU and 2.55 AU, and eccentricities of e = 0.43 and 0.27, respectively. A dynamical analysis of the system further shows a 5/1 mean motion resonance between the two planets. This system is of particular interest since the inner planet is within the brown-dwarf limits while the outer one is much less massive. Therefore, either the inner planet formed simultaneously in the protoplanetary disk as a superplanet, or the outer Jupiter-like planet formed in a circumbinary disk. We believe this singular planetary system will provide important constraints on planetary formation and migration scenarios.Comment: 9 pages, 14 figures, accepted in A&A, 12-May-200

A Strategy for Identifying the Grid Stars for the Space Interferometry Mission (SIM)

We present a strategy to identify several thousand stars that are astrometrically stable at the micro-arcsecond level for use in the SIM (Space Interferometry Mission) astrometric grid. The requirements on the grid stars make this a rather challenging task. Taking a variety of considerations into account we argue for K giants as the best type of stars for the grid, mainly because they can be located at much larger distances than any other type of star due to their intrinsic brightness. We show that it is possible to identify suitable candidate grid K giants from existing astrometric catalogs. However, double stars have to be eliminated from these candidate grid samples, since they generally produce much larger astrometric jitter than tolerable for the grid. The most efficient way to achieve this is probably by means of a radial velocity survey. To demonstrate the feasibility of this approach, we repeatedly measured the radial velocities for a pre-selected sample of 86 nearby Hipparcos K giants with precisions of 5-8 m/s. The distribution of the intrinsic radial velocity variations for the bona-fide single K giants shows a maximum around 20 m/s, which is small enough not to severely affect the identification of stellar companions around other K giants. We use the results of our observations as input parameters for Monte-Carlo simulations on the possible design of a radial velocity survey of all grid stars. Our favored scenario would result in a grid which consists to 68% of true single stars and to 32% of double or multiple stars with periods mostly larger than 200 years, but only 3.6% of all grid stars would display astrometric jitter larger than 1 microarcsecond. This contamination level is probably tolerable.Comment: LaTeX, 21 pages, 8 figures, accepted by PASP (February 2001 issue). Also available at http://beehive.ucsd.edu/ftp/pub/grid/kgiants.htm

Keeping calm in the face of change: towards optimisation of FRP by reasoning about change

Functional Reactive Programming (FRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals (time-varying values). FRP is based on the synchronous data-flow paradigm and supports both (an approximation to) continuous-time and discrete-time signals (hybrid systems).What sets FRP apart from most other languages for similar applications is its support for systems with dynamic structure and for higher-order reactive constructs. This paper contributes towards advancing the state of the art of FRP implementation by studying the notion of signal change and change propagation in a setting of structurally dynamic networks of n-ary signal functions operating on mixed continuous-time and discrete-time signals. We first define an ideal denotational semantics (time is truly continuous) for this kind of FRP, along with temporal properties, expressed in temporal logic, of signals and signal functions pertaining to change and change propagation. Using this framework, we then show how to reason about change; specifically, we identify and justify a number of possible optimisations, such as avoiding recomputation of unchanging values. Note that due to structural dynamism, and the fact that the output of a signal function may change because time is passing even if the input is unchanging, the problem is significantly more complex than standard change propagation in networks with static structure